An isogeny-based quantum-resistant secret sharing scheme

In a secret sharing scheme, is distributed among several participants in such way that only any authorized subset of able to recover the secret. So far, security many schemes has been based on hardness some mathematical problems, as discrete logarithm and factorization. These problems can be solved polynomial time using Shor?s algorithm for quantum computer. this paper, we propose an efficient multi-secret scheme computing isogenies between supersingular elliptic curves. The proposed De Feo Jao key exchange protocol. We prove our secure under computational assumptions which there no known algorithm.